def merge_sort(arr):
    if len(arr) > 1:
        mid = len(arr) // 2
        left_half = arr[:mid]
        right_half = arr[mid:]

        merge_sort(left_half)
        merge_sort(right_half)

        merge(arr, left_half, right_half)

def merge(arr, left_half, right_half):
    # i 是对 left_half进行操作，j 是对 right_half进行操作，k 是对 arr进行操作
    i = j = k = 0

    # 将左右两个有序数组合并成一个有序数组
    while i < len(left_half) and j < len(right_half):
        if left_half[i] < right_half[j]:
            arr[k] = left_half[i]
            i += 1
        else:
            arr[k] = right_half[j]
            j += 1
        k += 1

    # 处理剩余的元素
    while i < len(left_half):
        arr[k] = left_half[i]
        i += 1
        k += 1

    while j < len(right_half):
        arr[k] = right_half[j]
        j += 1
        k += 1

# 示例
# arr = [12, 13, 11, 5, 6, 7]
# merge_sort(arr)
# print("排序后的数组:", arr)



a=[int(i) for i in input().split()]
print(a)